Approximating generalized distance functions on weighted triangulated surfaces with applications
نویسندگان
چکیده
منابع مشابه
Topological Hierarchy for Functions on Triangulated Surfaces
We combine topological and geometric methods to construct a multi-resolution representation for a function over a two-dimensional domain. In a preprocessing stage, we create the Morse-Smale complex of the function and progressively simplify its topology by canceling pairs of critical points. Based on a simple notion of dependency among these cancellations we construct a hierarchical data struct...
متن کاملProperties of Distance Functions on Convex Surfaces and Applications
If X is a convex surface in a Euclidean space, then the squared intrinsic distance function dist(x, y) is DC (d.c., delta-convex) on X×X in the only natural extrinsic sense. An analogous result holds for the squared distance function dist(x,F ) from a closed set F ⊂ X. Applications concerning r-boundaries (distance spheres) and ambiguous loci (exoskeletons) of closed subsets of a convex surface...
متن کاملComputing generalized higher-order Voronoi diagrams on triangulated surfaces
We present an algorithm for computing exact shortest paths, and consequently distance functions, from a generalized source (point, segment, polygonal chain or polygonal region) on a possibly non-convex triangulated polyhedral surface. The algorithm is generalized to the case when a set of generalized sites is considered, providing their distance field that implicitly represents the Voronoi diag...
متن کاملAnalysis and Comparison of Real Functions on Triangulated Surfaces
The study of geometric and topological properties of a triangulated surface M is ubiquitous in geometry and shape processing. In these contexts, different techniques in research areas such as shape abstraction, comparison, and parameterization are based on the study of local properties of a mapping function f : M → R and that correspond to specific properties of the input shape. Therefore, it b...
متن کاملApproximating Weighted Shortest Paths on Polyhedral Surfaces yz
Consider a simple polyhedron P, possibly non-convex, composed of n triangular regions (faces), in which each region has an associated positive weight. The cost of travel through each region is the distance traveled times its weight. We present and experimentally study several algorithms to compute an approximate weighted geodesic shortest path, 0 (s; t), between two points s and t on the surfac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2012
ISSN: 0377-0427
DOI: 10.1016/j.cam.2012.03.028